翻訳と辞書 Words near each other ・ Computer analyst ・ Computer and Internet Protocol Address Verifier ・ Computer and Management Institute ・ Computer and network surveillance ・ Computer and Video Games ・ Computer animation ・ Computer Animation and Social Agents ・ Computaris ・ Computation ・ Computation and Neural Systems ・ Computation history ・ Computation in the limit ・ Computation of cyclic redundancy checks ・ Computation of radiowave attenuation in the atmosphere ・ Computation offloading ・ Computation tree ・ Computation tree logic ・ Computational aeroacoustics ・ Computational algebra ・ Computational and Mathematical Organization Theory ・ Computational and Statistical Genetics ・ Computational and Structural Biotechnology Journal ・ Computational and Systems Neuroscience ・ Computational and Theoretical Chemistry ・ Computational archaeology ・ Computational astrophysics ・ Computational auditory scene analysis ・ Computational biology ・ Computational Biology and Chemistry ・ Computational chemical methods in solid-state physics Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Computation tree ： ウィキペディア英語版 Computation tree A computation tree is a representation for the computation steps of a non-deterministic Turing machine on a specified input.〔.〕 A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state, while each edge represents a transition to the next possible computation. The number of nodes of the tree is the size of the tree and the length of the path from the root to a given node is the depth of the node. The largest depth of an output node is the depth of the tree. The output nodes of the tree are called leaves. In a computation tree for a decision problem, each output node is labeled Yes or No. If a tree, T, with an input space X, if $x\; \backslash in\; X$ and the path for x ends in node labeled yes, then the input x is accepted. Else it is rejected.〔.〕 The depth of the computation tree for a given input is the computation time for the Turing machine on that input.〔 Computation trees have also been used to study the computational complexity of problems in computational geometry and real number calculations.〔.〕〔.〕 ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Computation tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.